Extended Horn Clauses: The Framework and Some Semantics
نویسندگان
چکیده
The purpose of this paper is twofold: to introduce a new extension of concurrent logic programming languages aiming at handling synchronicity and to present and compare several semantics for it. The extended framework essentially rests on an extension of Horn clauses, including multiple atoms in their heads and a guard construct, as well as a new operator between goals. The semantics discussed consist of four semantics. They range in the operational, declarative and denotational types and are issued both from the logic programming tradition and the imperative tradition. They are composed of an operational semantics, describing the (classical) success set and failure set, of two declarative semantics, extending the Herbrand interpretation and the immediate consequence operator to the extended framework, and of a denotational semantics, deened compositionally and on the basis of histories possibly involving hypothetical statements. The mathematical tools mainly used are complete lattices and complete metric spaces.
منابع مشابه
Comparative Semantics of Generalized Horn Clauses1
The purpose of this paper is to present and analyze semantically a new extension of concurrent logic programming languages aiming at handling synchronicity. It essentially rests on an extension of Horn clauses, called generalized Horn clauses, and on a new parallel operator between goals. Five semantics are presented and compared. They range in the operational, declarative and denotational type...
متن کاملA Synchronization Logic: Axiomatics and Formal Semantics of Generalized Horn Clauses
An extension of Horn clause logic is defined based on the introduction of a synchronization operator. Generalized Horn clauses (GHC) are introduced through an informal description of their operational semantics, which allows discussion of some typical synchronization problems. GHC are first considered formally as a programming language by defining the syntax, the operational semantics, the mode...
متن کاملProbabilistic Horn Clause Verification
Constrained Horn clauses have proven to be a natural intermediate language for logically characterizing program semantics and reasoning about program behavior. In this paper, we present probabilistically constrained Horn clauses (pchc), which incorporate probabilistic variables inside otherwise traditional constrained Horn clauses. pchc enable reasoning about probabilistic programs by encoding ...
متن کاملA Functorial Framework for Constraint Normal Logic Programming
The semantic constructions and results for definite programs do not extend when dealing with negation. The main problem is related to a well-known problem in the area of algebraic specification: if we fix a constraint domain as a given model, its free extension by means of a set of Horn clauses defining a set of new predicates is semicomputable. However, if the language of the extension is rich...
متن کاملThe SeaHorn Verification Framework
In this paper, we present SeaHorn, a software verification framework. The key distinguishing feature of SeaHorn is its modular design that separates the concerns of the syntax of the programming language, its operational semantics, and the verification semantics. SeaHorn encompasses several novelties: it (a) encodes verification conditions using an efficient yet precise inter-procedural techniq...
متن کامل